Binary Morphisms to Ultimately Periodic Words
نویسنده
چکیده
This paper classifies morphisms from {0, 1} that map to ultimately periodic words. In particular, if a morphism h maps an infinite non-ultimately periodic word to an ultimately periodic word then it must be true that h(0) commutes with h(1).
منابع مشابه
Binary Equality Words for Periodic Morphisms
Let g and h be binary morphisms defined on {a, b}∗, and let g be periodic and h nonperiodic. It is well known that their equality language is generated by at most one nonempty word. Suppose |h(b)| ≥ |h(a)|. We show that then the equality word is equal to aba , with i, j ≥ 0. Binary equality sets are the simplest nontrivial equality languages. Nevertheless, their full description is still not kn...
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملOn stabilizers of infinite words
The stabilizer of an infinite word w over a finite alphabet Σ is the monoid of morphisms over Σ that fix w. In this paper we study various problems related to stabilizers and their generators. We show that over a binary alphabet, there exist stabilizers with at least n generators for all n. Over a ternary alphabet, the monoid of morphisms generating a given infinite word by iteration can be inf...
متن کاملPermutation complexity of the fixed points of some uniform binary morphisms
The notion of an infinite permutation was introduced in [1], where were investigated the periodic properties and low complexity of permutations. Similarly to the definition of subword complexity of infinite words, we can introduce the notion of the factor complexity of a permutation as the number of distinct subpermutations of a given length. The notion of a permutation generated by an infinite...
متن کاملCharacterization of Infinite Solutions of Marked and Binary Post Correspondence Problems
In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem is undecidable in general, but it is known to be decidable for binary and marked instances. A morphism is binary, if the domain alphabet is of size 2, and marked, if each image of a le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0805.1373 شماره
صفحات -
تاریخ انتشار 2004